Exploiting Single-Cycle Symmetries in Continuous Constraint Problems
نویسندگان
چکیده
منابع مشابه
Exploiting Single-Cycle Symmetries in Continuous Constraint Problems
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a continuous constraint solver without ...
متن کاملExploiting Single-Cycle Symmetries in Branch-and-Prune algorithms
As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cu...
متن کاملAutomatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and non-linear equations, then compiles them into SAT instances via Boolean logic circuits. While in general reduction to SAT may lead to the loss of structure, we specifically detect several types of structure in high-level input and use them in compilation....
متن کاملExploiting symmetries within constraint satisfaction search
Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry within depth-first search is proposed, leading to two heuristics for variable selection and a domain pruning procedure. These strategies are then applied to two highly symmetric combinatorial problems, namely the Ra...
متن کاملBreaking Symmetries in Distributed Constraint Programming Problems
Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method forAdopt andDp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2009
ISSN: 1076-9757
DOI: 10.1613/jair.2711